Circular annular planar monopoles with EM coupling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Drawing Planar Graphs with Circular Arcs

In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the area of drawings in which edges are drawn using exactly one circular arc. We also give an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. The algorithm ru...

متن کامل

Multilayer Circularly Polarized Circular Annular Ring Patch

This paper presents the effect on circular polarization of multilayer circular annular ring patch (CARP). A CARP have been fabricated on FR4 substrate of dielectric constant 4.2 and thickness 1.52mm. Experimental resonant frequency impedance bandwidth and Axial ratio of simple CARP, covered CARP, spaced dielectric CARP and CARP with two superstrates have been measured and simulated using full w...

متن کامل

Fully Planar Circular Microstrip Crossover

A circular patch based crossover is presented in the paper. The proposed crossover provides an isolation better than -22dB and transmission of 0dB in the band of operation. This crossover is compared with a rectangular patch based crossover operating at same frequency.

متن کامل

Circular Planar Resistor Networks with Nonlinear and Signed Conductors

We consider the inverse boundary value problem in the case of discrete electrical networks containing nonlinear (non-ohmic) resistors. Generalizing work of Curtis, Ingerman, Morrow, Colin de Verdière, Gitler, and Vertigan, we characterize the circular planar graphs for which the inverse boundary value problem has a solution in this generalized non-linear setting. The answer is the same as in th...

متن کامل

Universal Point Sets for Planar Graph Drawings with Circular Arcs

We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEE Proceedings - Microwaves, Antennas and Propagation

سال: 2003

ISSN: 1350-2417

DOI: 10.1049/ip-map:20030476